Simple Generalized Group-Oriented Cryptosystems Using ElGamal Cryptosystem

نویسندگان

  • Chou Chen Yang
  • Ting Yi Chang
  • Jian Wei Li
  • Min-Shiang Hwang
چکیده

In the generalized group-oriented cryptosystem, the sender can send a conditional message to a group of users such that only the specified sets of users in this group can cooperate to decrypt this message. In this paper, we will use an ElGamal cryptosystem and an elliptic curve ElGamal cryptosystem to achieve the purposes of generalization and group-orientation, respectively. Both of our schemes are more efficient than Tsai et al.’s scheme in terms of sender’s computational complexity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Security Flaw in Simple Generalized Group-Oriented Cryptosystem Using ElGamal Cryptosystem

A generalized group-oriented cryptosystem (GGOC) based on ElGamal cryptosystem was proposed by Yang et al. in 2003. This study shows that if the authorized decryption sets of users are not properly predetermined in Yang et al.’s GGOC, an unauthorized decryption set of users can recover the encrypted message without difficulty. This study also presents an improved protocol to resist such an attack.

متن کامل

Dynamic Threshold Cryptosystems ( A New Scheme in Group Oriented Cryptography ) Hossein

A new concept in group oriented cryptography { the dynamic threshold cryp-tosystem { is presented in the paper. The dynamic system has many advantages over the existing threshold cryptosystems. It is set up by the sender who can not only compose the group of recipients but select the threshold as well. Implementations of the dynamic system based on the ElGamal and the RSA public key cryptosyste...

متن کامل

A Cryptosystem Based on the Symmetric Group Sn

This paper proposes a public key cryptosystem based on the symmetric group Sn, and validates its theoretical foundation. The proposed system benefits from the algebraic properties of Sn such as non commutative, high computational speed and high flexibility in selecting keys which make the Discrete Logarithm Problem (DLP) resistant to attacks by algorithms such as PohligHellman. Against these pr...

متن کامل

Secure ElGamal-Type Cryptosystems Without Message Encoding

ElGamal cryptosystem is one of the oldest public-key cryptosystems. It is known to be semantically secure for arbitrary messages in the random oracle model under the decisional Diffie-Hellman assumption. Semantic security also holds in the standard model when messages are encoded as elements in the group for which the decisional Diffie-Hellman assumption is defined. This paper introduces a sett...

متن کامل

An On-chip Data Storage with ElGamal Elliptic Curve Cryptosystems

An On-chip Data Storage with cryptosystem proposed in this paper was designed for modern smart card system and “on the fly data encryption/decryption”. To ensure the security, the ElGamal Elliptic curve cryptosystems with the key size of 176 bits was embeded. The design can be configured to be either the encrypter or the decryptor with simple control signals. To minimize the hardware cost, size...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Informatica, Lith. Acad. Sci.

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2003